منابع مشابه
Probabilistic Set Covering with Correlations
We consider a probabilistic set covering problem where there is uncertainty regarding whether a selected set can cover an item, and the objective is to determine a minimum-cost combination of sets so that each item is covered with a pre-specified probability. To date, literature on this problem has focused on the special case in which uncertainties are independent. In this paper, we formulate c...
متن کامل“Eyes Open – Eyes Closed” EEG/fMRI data set including dedicated “Carbon Wire Loop” motion detection channels
This data set contains electroencephalography (EEG) data as well as simultaneous EEG with functional magnetic resonance imaging (EEG/fMRI) data. During EEG/fMRI, the EEG cap was outfitted with a hardware-based add-on consisting of carbon-wire loops (CWL). These yielded six extra׳CWL׳ signals related to Faraday induction of these loops in the main magnetic field "Measurement and reduction of mot...
متن کاملSkin: Uncovering Our Covering
Michele de Luca (University of Modena, Italy) concluded his talk then paused and looked out across the auditorium. The response of those attending the 2017 Congress of the European Society of Gene & Cell Therapy (Berlin, Germany) was immediate and rapturous. De Luca had just presented a case study in which a seven-year-old boy suffering from a devastating skin disease had been saved by regenera...
متن کاملDiagnostic Reasoning with Multilevel Set-Covering Models
We consider multilevel set-covering models for diagnostic reasoning: though a lot of work has been done in this field, knowledge acquisition efforts have been investigated only insufficiently. We will show how set-covering models can be build incrementally and how they can be refined by knowledge enhancements or representational extensions. All these extensions have a primary characteristic: th...
متن کاملSet Covering Problems with General Objective Functions
We introduce a parameterized version of set cover that generalizes several previously studied problems. Given a ground set V and a collection of subsets Si of V , a feasible solution is a partition of V such that each subset of the partition is included in one of the Si. The problem involves maximizing the mean subset size of the partition, where the mean is the generalized mean of parameter p,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2013
ISSN: 0097-5397,1095-7111
DOI: 10.1137/100802888